A Survey of the Proof-Theoretic Foundations of Logic Programming

A Tutorial on Proof Theoretic Foundations of Logic Programming

Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

A Proof-Theoretic Framework for Logic Programming

An Argumentation-Theoretic Foundations for Logic Programming

D Logic programs are considered as abductive programs with negative literals as abductive hypotheses. A simple framework for semantics of logic programming is introduced based on the notion of acceptable hypotheses. We show tha t our framework captures, generalizes, and unifies different semantic concepts (e.g., well-founded models, stable models, s ta t ionary semantics, etc.) in logic program...

A Uniform Proof-Theoretic Investigation of Linear Logic Programming

In this paper we consider the problem of identifying logic programming languages for linear logic. Our analysis builds on a notion of goal-directed provability, characterized by the so-called uniform proofs, previously introduced for minimal and intuitionistic logic. A class of uniform proofs in linear logic is identiied by an analysis of the permutability of inferences in the linear sequent ca...